Group-theoretic Algorithms for Multiphoton Interferometery
نویسندگان
چکیده
Introduction and Background WignerD-functions are the matrix elements of the representations of finite group SU(n) of n × n special unitary matrices. Wigner D-functions of SU(2) group elements are used in nuclear, atomic and molecular physics [1–3]. In the Standard Model of particle physics, SU(2), SU(3) and SU(6) D-functions are used to describe transformations that preserve global or local symmetries [4–6]. Recently, SU(n) transformations have been the subject of considerable interest because of the BosonSampling problem. The output from an n-channel passive optical interferometer affecting a SU(n) transformation on indistinguishable single-photon pulse inputs is computationally hard classically subject to conjectures [7–9]. The action of three-channel optical interferometers on partially distinguishable single-photon inputs is best described by SU(3) D-functions [10–12]. D-functions of SU(2) group elements are well studied and tabulated [13]. SU(3) D-functions in a weight basis can be calculated as products of SU(2) Wigner Dfunctions [14, 15]. D-functions in the weight basis, which connect eigenstates of the weight-basis elements of su(n), su(n − 1) . . . su(2) Lie algebras, are especially suitable for studying permutational symmetric Bosonic systems. D-functions in the GelfandTsetlin basis for su(n) algebras can be constructed [16,17] but these functions lack the manifest permutational symmetries that arise in physical systems like BosonSampling interferometers.
منابع مشابه
The Effect of Grammar vs. Vocabulary Pre-teaching on EFL Learners’ Reading Comprehension: A Schema-Theoretic View of Reading
This study was designed to investigate the effect of grammar and vocabulary pre-teaching, as two types of pre-reading activities, on the Iranian EFL learners’ reading comprehension from a schema–theoretic perspective. The sample consisted of 90 female students studying at pre-university centers of Isfahan. The subjects were randomly divided into three equal-in-number groups. They participated ...
متن کاملFast matrix multiplication is stable
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63–72]. As a consequence of our analysis, we show that the exponent of matrix multiplication (the optimal running time) can be achieved by numerically stable algorithms. We also s...
متن کاملGroup-Theoretic Partial Matrix Multiplication
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve upper bounds on the exponent of matrix multiplication yielded by group-theoretic full matrix multiplication. The group theory behind our partial matrix multipli...
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملA Game Theoretic Approach for Sustainable Power Systems Planning in Transition
Intensified industrialization in developing countries has recently resulted in huge electric power demand growth; however, electricity generation in these countries is still heavily reliant on inefficient and traditional non-renewable technologies. In this paper, we develop an integrated game-theoretic model for effective power systems planning thorough balancing between supply and demand for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014